Algebraic Structures of Directed Acyclic Graphs: Application to Concurrent Calculus
نویسنده
چکیده
The paper deenes an algebraic tool for manipulating directed acyclic graphs (on short dags). The approach we propose combines two mathematical tools { category theory and universal algebra { and it allows an unitary treating of dags transformations. We show that the speciication, implementation and programming of concurrent systems can be achieved by using this theory.
منابع مشابه
SYNOPS - Generation of Partial Languages and Synthesis of Petri Nets
We present the command line tool SYNOPS. It allows the term-based construction of partial languages consisting of different kinds of causal structures representing runs of a concurrent system: labeled directed acyclic graphs (LDAGs), labeled partial orders (LPOs), labeled stratified directed acyclic graphs (LSDAGs) and labeled stratified order structures (LSOs). It implements region based algor...
متن کاملAn Algebraic Formalization of Forward and Forward-backward Algorithms
In this paper, we propose an algebraic formalization of the two important classes of dynamic programming algorithms called forward and forward-backward algorithms. They are generalized extensively in this study so that a wide range of other existing algorithms is subsumed. Forward algorithms generalized in this study subsume the ordinary forward algorithm on trellises for sequence labeling, the...
متن کاملLuis Fariñas del Cerro Olivier Gasquet MINIMAL STRUCTURES FOR MODAL TABLEAUX : Some Examples
In this paper we present some examples of decision procedures based on tableau calculus for some monoand multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted direc...
متن کاملMINIMAL STRUCTURES FOR MODAL TABLEAUX: Some Examples
In this paper we present some examples of decision procedures based on tableau calculus for some monoand multimodal logics having a semantics involving properties that are not easily representable in tree-like structures (like e.g. density, confluence and persistence). We show how to handle them in our framework by generalizing usual tableaux (which are trees) to richer structures: rooted direc...
متن کاملCausal Effect Identification in Alternative Acyclic Directed Mixed Graphs
Alternative acyclic directed mixed graphs (ADMGs) are graphs that may allow causal effect identification in scenarios where Pearl’s original ADMGs may not, and vice versa. Therefore, they complement each other. In this paper, we introduce a sound algorithm for identifying arbitrary causal effects from alternative ADMGs. Moreover, we show that the algorithm is complete for identifying the causal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998